Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials

We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding low-complexity functions lacking sparse representations. When ${\cal C}$ is the set of PARITY functions or the set of conjunctions, this sort of problem has a well-understood answer, the problem becomes interesting when ${\cal C}$ is "overcomplete" and the set of functions is not linearly independent. We focus on the cases where ${\cal C}$ is the set of linear threshold functions, the set of rectified linear units (ReLUs), and the set of low-degree polynomials over a finite field, all of which are well-studied in different contexts. We provide generic tools for proving lower bounds on representations of this kind. Applying these, we give several new lower bounds for "semi-explicit" Boolean functions. For example, we show there are functions in nondeterministic quasi-polynomial time that require super-polynomial size: $\bullet$ Depth-two neural networks with sign activation function, a special case of depth-two threshold circuit lower bounds. $\bullet$ Depth-two neural networks with ReLU activation function. $\bullet$ $\mathbb{R}$-linear combinations of $O(1)$-degree $\mathbb{F}_p$-polynomials, for every prime $p$ (related to problems regarding Higher-Order "Uncertainty Principles"). We also obtain a function in $E^{NP}$ requiring $2^{\Omega(n)}$ linear combinations. $\bullet$ $\mathbb{R}$-linear combinations of $ACC \circ THR$ circuits of polynomial size (further generalizing the recent lower bounds of Murray and the author). (The above is a shortened abstract. For the full abstract, see the paper.

The Orthogonal Vectors Conjecture for Branching Programs and Formulas

In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among n Boolean vectors in d dimensions. The OV Conjecture (OVC) posits that OV requires n^{2-o(1)} time to solve, for all d=omega(log n). Assuming the OVC, optimal time lower bounds have been proved for many prominent problems in P, such as Edit Distance, Frechet Distance, Longest Common Subsequence, and approximating the diameter of a graph. We prove that OVC is true in several computational models of interest: - For all sufficiently large n and d, OV for n vectors in {0,1}^d has branching program complexity Theta~(n * min(n,2^d)). In particular, the lower and upper bounds match up to polylog factors. - OV has Boolean formula complexity Theta~(n * min(n,2^d)), over all complete bases of O(1) fan-in. - OV requires Theta~(n * min(n,2^d)) wires, in formulas comprised of gates computing arbitrary symmetric functions of unbounded fan-in. Our lower bounds basically match the best known (quadratic) lower bounds for any explicit function in those models. Analogous lower bounds hold for many related problems shown to be hard under OVC, such as Batch Partial Match, Batch Subset Queries, and Batch Hamming Nearest Neighbors, all of which have very succinct reductions to OV. The proofs use a certain kind of input restriction that is different from typical random restrictions where variables are assigned independently. We give a sense in which independent random restrictions cannot be used to show hardness, in that OVC is false in the "average case" even for AC^0 formulas: For all p in (0,1) there is a delta_p > 0 such that for every n and d, OV instances with input bits independently set to 1 with probability p (and 0 otherwise) can be solved with AC^0 formulas of O(n^{2-delta_p}) size, on all but a o_n(1) fraction of instances. Moreover, lim_{p - > 1}delta_p = 1

An Experimental Investigation of Conformational Fluctuations in Proteins G and L

SummaryThe B1 domains of streptococcal proteins G and L are structurally similar, but they have different sequences and they fold differently. We have measured their NMR spectra at variable temperature using a range of concentrations of denaturant. Many residues have curved amide proton temperature dependence, indicating that they significantly populate alternative, locally unfolded conformations. The results, therefore, provide a view of the locations of low-lying, locally unfolded conformations. They indicate approximately 4–6 local minima for each protein, all within ca. 2.5 kcal/mol of the native state, implying a locally rough energy landscape. Comparison with folding data for these proteins shows that folding involves most molecules traversing a similar path, once a transition state containing a β hairpin has been formed, thereby defining a well-populated pathway down the folding funnel. The hairpin that directs the folding pathway differs for the two proteins and remains the most stable part of the folded protein

Faculty Brass Showcase

This special recital features solo and collaborative performances by the talented members of the KSU brass faculty including Doug Lindsey and Ryan Moser, trumpets, Richard Williams, horn, Jason Casanova, euphonium, and Paul Dickinson, tuba.https://digitalcommons.kennesaw.edu/musicprograms/2102/thumbnail.jp

KSU Brass Faculty Recital

Enjoy a performance by the KSU brass faculty: Doug Lindsey, Mike Tiscione, Richard Williams, J.D. Handshoe, and Ryan Moser, all accompanied pianists Judith Cole and Eric Jenkins.https://digitalcommons.kennesaw.edu/musicprograms/2377/thumbnail.jp

Fine-Grained Reductions from Approximate Counting to Decision

In this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus we use an oracle that decides whether any witness exists to multiplicatively approximate the number of witnesses with minimal overhead.) This mirrors a foundational result of Sipser (STOC 1983) and Stockmeyer (SICOMP 1985) in the polynomial-time setting, and a similar result of M\"uller (IWPEC 2006) in the FPT setting. Using our framework, we obtain such reductions for some of the most important problems in fine-grained complexity: the Orthogonal Vectors problem, 3SUM, and the Negative-Weight Triangle problem (which is closely related to All-Pairs Shortest Path). We also provide a fine-grained reduction from approximate #SAT to SAT. Suppose the Strong Exponential Time Hypothesis (SETH) is false, so that for some $1<c<2$ and all $k$ there is an $O(c^n)$-time algorithm for k-SAT. Then we prove that for all $k$, there is an $O((c+o(1))^n)$-time algorithm for approximate #$k$-SAT. In particular, our result implies that the Exponential Time Hypothesis (ETH) is equivalent to the seemingly-weaker statement that there is no algorithm to approximate #3-SAT to within a factor of $1+\epsilon$ in time $2^{o(n)}/\epsilon^2$ (taking $\epsilon > 0$ as part of the input).Comment: An extended abstract was presented at STOC 201

KSU Faculty Brass Recital

The Brass faculty of the KSU School of Music present their fall concert, with works by Booze, McKee, Atterburg, Williams, Handel, and Koetsier.https://digitalcommons.kennesaw.edu/musicprograms/2314/thumbnail.jp

A common and unstable copy number variant is associated with differences in Glo1 expression and anxiety-like behavior

Glyoxalase 1 (Glo1) has been implicated in anxiety-like behavior in mice and in multiple psychiatric diseases in humans. We used mouse Affymetrix exon arrays to detect copy number variants (CNV) among inbred mouse strains and thereby identified a approximately 475 kb tandem duplication on chromosome 17 that includes Glo1 (30,174,390-30,651,226 Mb; mouse genome build 36). We developed a PCR-based strategy and used it to detect this duplication in 23 of 71 inbred strains tested, and in various outbred and wild-caught mice. Presence of the duplication is associated with a cis-acting expression QTL for Glo1 (LOD>30) in BXD recombinant inbred strains. However, evidence for an eQTL for Glo1 was not obtained when we analyzed single SNPs or 3-SNP haplotypes in a panel of 27 inbred strains. We conclude that association analysis in the inbred strain panel failed to detect an eQTL because the duplication was present on multiple highly divergent haplotypes. Furthermore, we suggest that non-allelic homologous recombination has led to multiple reversions to the non-duplicated state among inbred strains. We show associations between multiple duplication-containing haplotypes, Glo1 expression and anxiety-like behavior in both inbred strain panels and outbred CD-1 mice. Our findings provide a molecular basis for differential expression of Glo1 and further implicate Glo1 in anxiety-like behavior. More broadly, these results identify problems with commonly employed tests for association in inbred strains when CNVs are present. Finally, these data provide an example of biologically significant phenotypic variability in model organisms that can be attributed to CNVs.These studies were funded by MH070933, MH79103 and MH020065

Self-Determination Theory Applied to Health Contexts: A Meta-Analysis \ud

Behavior change is more effective and lasting when patients are autonomously motivated. To examine this idea, we identified 184 independent data sets from studies that utilized self-determination theory (SDT; Deci & Ryan, 2000) in health care and health promotion contexts. A meta-analysis evaluated relations between the SDT-based constructs of practitioner support for patient autonomy and patients’ experience of psychological need satisfaction, as well as relations between these SDT constructs and indices of mental and physical health. Results showed the expected relations among the SDT variables, as well as positive relations of psychological need satisfaction and autonomous motivation to beneficial health outcomes. Several variables (e.g., participants’ age, study design) were tested as potential moderators when effect sizes were heterogeneous. Finally, we used path analyses of the meta-analyzed correlations to test the interrelations among the SDT variables. Results suggested that SDT is a viable conceptual framework to study antecedents and outcomes of motivation for health-related behaviors